Regularizing Inverse Preconditioners for Symmetric Band Toeplitz Matrices
نویسندگان
چکیده
Image restoration is a widely studied discrete ill-posed problem. Among the many regularization methods used for treating the problem, iterative methods have been shown to be effective. In this paper, we consider the case of a blurring function defined by space invariant and band-limited PSF, modeled by a linear system that has a band block Toeplitz structure with band Toeplitz blocks. In order to reduce the number of iterations required to obtain acceptable reconstructions, in [1] an inverse Toeplitz preconditioner for problems with a Toeplitz structure was proposed. The cost per iteration is of O(n2 logn) operations, where n2 is the pixel number of the 2D image. In this paper, we propose inverse preconditioners with a band Toeplitz structure, which lower the cost to O(n2) and in experiments showed the same speed of convergence and reconstruction efficiency as the inverse Toeplitz preconditioner.
منابع مشابه
A polynomial fit preconditioner for band Toeplitz matrices in image reconstruction
The preconditioned conjugate gradient (CG) is often applied in image reconstruction as a regularizing method. When the blurring matrix has Toeplitz structure, the modified circulant preconditioner and the inverse Toeplitz preconditioner have been shown to be effective. We introduce here a preconditioner for symmetric positive definite Toeplitz matrices based on a trigonometric polynomial fit wh...
متن کاملAn explicit formula for the inverse of band triangular Toeplitz matrix
In order to estimate the condition number of the preconditioned matrix proposed in [F.R. Lin, W.K. Ching, Inverse Toeplitz preconditioners for Hermitian Toeplitz systems, Numer. Linear Algebra Appl. 12 (2005) 221–229], we study the inverse of band triangular Toeplitz matrix. We derive an explicit formula for the entries of the inverse of band lower triangular Toeplitz matrix by means of divided...
متن کاملToeplitz-Circulant Preconditioners for Toeplitz Systems and their Applications to Queueing Networks with Batch Arrivals
The preconditioned conjugate gradient method is employed to solve Toeplitz systems T n x = b where the generating functions of the n-by-n Toeplitz matrices T n are functions with zeros. In this case, circulant preconditioners are known to give poor convergence, whereas band-Toeplitz preconditioners only ooer linear convergence and can only handle real-valued functions with zeros of even orders....
متن کاملPreconditioning Techniques for Diagonal-times-Toeplitz Matrices in Fractional Diffusion Equations
The fractional diffusion equation is discretized by an implicit finite difference scheme with the shifted Grünwald formula, which is unconditionally stable. The coefficient matrix of the discretized linear system is equal to the sum of a scaled identity matrix and two diagonal-times-Toeplitz matrices. Standard circulant preconditioners may not work for such Toeplitz-like linear systems. The mai...
متن کاملA Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices
Circulant preconditioners that cluster eigenvalues are well established for linear systems involving symmetric positive definite Toeplitz matrices. For these preconditioners rapid convergence of the preconditioned conjugate gradient method is guaranteed. Since circulant preconditioners can be applied quickly using the fast Fourier transform, preconditioned CG with circulant preconditioning is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007